Accelerated CDOCKER with GPUs, Parallel Simulated Annealing, and Fast Fourier Transforms
نویسندگان
چکیده
منابع مشابه
Energy Transforms for Metropolis and Simulated Annealing Algorithms Energy Transforms for Metropolis and Simulated Annealing Algorithms
We present here a method to speed up Metropolis algorithms which can be viewed as an alternative to simulated annealing. We show that this method of energy transformation compares favourably with simulated annealing in the asymptotic of a close to one probability of convergence. It requires an estimate of the minimum value of the energy function to be known, but if only a loose estimate is avai...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملAlgorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...
متن کاملParallel Fast Fourier Transforms for Non Power of Two Data
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequences of length N not equal to a power of two. The method described is an extension of existing power of two transforms to sequences with N a product of small primes. In particular, this implementation requires N = 2 p 3 q 5 r. The communication required is the same as for a transform of length N = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Theory and Computation
سال: 2020
ISSN: 1549-9618,1549-9626
DOI: 10.1021/acs.jctc.0c00145